Minimizing the Maximum Delay in Wireless Sensor Networks by Intelligent Sink Placement

نویسندگان

  • Wint Yi Poe
  • Jens B. Schmitt
چکیده

Research activity in the area of wireless sensor networks(WSNs) has grown dramatically in the past few years, driven by advances in miniaturized hardware, and motivated by a vast array of potential applications. Typical scenarios for large-scale WSNs contain multiple sources and multiple sinks. In WSNs, energy is the most critical resource constraint and the lifetime of a WSNs is dependent on limited battery although there are several promising methods for energy scavenging which need additional circuitry and cost. Besides, performance issues in WSNs play a vital role in some applications as for example message transfer delay for detection systems. Therefore, in this research, we focus on the sink placement problem for minimizing the maximum worst-case delay as well as maximizing the lifetime of a WSN. Di erent sink placement strategies are introduced and their advantages and disadvantages are discussed. A random sink placment (RSP) strategy is used as a lower bound for other strategies. A geographic sink placement (GSP) strategy is proposed as a benchmark sink placement in WSNs whereas an intelligent sink placement (ISP) strategy is introduced as an optimal sink placement. Due to the computational expensiveness of ISP, a Genetic Algorithm-based sink placement (GASP) strategy is discussed and is demonstrated to represent a good approximation for the optimal sink placement. During the performance analysis of the sink placement strategies, the question of a good number of sinks given a certain number of sensor nodes is also discussed. To calculate the maximum worst-case delay, sensor network calculus (introduced in [8]), a recent methodology, is applied in this research work. The core of this research work is to give a framework for sink placement in real-time WSNs applications with two GSP and GASP strategies. The GSP strategies are suited for WSNs in which sensor nodes positions are unknown, whereas the GASP strategies are designated for WSNs when given sensor nodes' positions. Finally, numerical results are obtained using DISCO network calculator [7] for di erent scenarios.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Energy Efficient Clustering Method using Bat Algorithm and Mobile Sink in Wireless Sensor Networks

Wireless sensor networks (WSNs) consist of sensor nodes with limited energy. Energy efficiency is an important issue in WSNs as the sensor nodes are deployed in rugged and non-care areas and consume a lot of energy to send data to the central station or sink if they want to communicate directly with the sink. Recently, the IEEE 802.15.4 protocol is employed as a low-power, low-cost, and low rat...

متن کامل

Quasi Random Deployment Strategy for Reliable Communication Backbones in Wireless Sensor Networks

Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...

متن کامل

A fault tolerance routing protocol considering defined reliability and energy consumption in wireless sensor networks

In wireless sensor networks, optimal consumptionof energy and having maximum life time are important factors. In this article attempt has been made to send the data packets with particular reliability from the beginning based on AODV protocol. In this way two new fields add to the routing packets and during routing and discovering of new routes, the lowest remained energy of nodes and route tra...

متن کامل

Sink Location Service Based on Fano Plane in Wireless Sensor Networks

Sink location is considered as a basic service in geographic routing in wireless sensor networks. Obtaining the location of sink node by source node using an efficient method with low complexity has always been a challenging issue in research. In this paper, a sink location algorithm based on Fano plane is proposed. The research challenge is how to ensure the intersection of two SLQ (Location Q...

متن کامل

A multiple criteria algorithm for planning the itinerary of mobile sink in wireless sensor networks

The mobile sink can increase the efficiency of wireless sensor networks. It moves in a monitored environment and collects the network nodes information. Thus, by the sink we can balance the power consumption and increases the network lifetime. Determining path of the sink's movement is usually modeled as an optimization problem where finding optimal solutions require collecting value of all the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007